An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure
نویسندگان
چکیده
While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this paper we propose an abductive semantics for disjunctive logic programs with default negation and show that Eshghi and Kowal-ski's abductive proof procedure for normal programs can be adopted to compute abductive solutions for disjunctive programs.
منابع مشابه
An abductive approach to disjunctive logic programming
Nonmonotonic reasoning has been explored as a form of abductive reasoning where default assumptions are treated as abductive hypotheses. While the semantics and proof theories under this approach have been studied extensively , the question of how disjunctive programs may be used to reason abductively has rarely been investigated. At the center of the question is how to embed disjunctive reason...
متن کاملRegular Extension Semantics and Disjunctive Eshghi Kowalski Procedure
Can the elegant abductive proof procedure by Eshghi and Kowalski be extended to answer queries for disjunctive logic programs? If yes, what is the semantics that such an extended procedure computes? Several years ago, in an unpublished manuscript Dung speciied a proof procedure that embeds a form of linear resolution into the Eshghi-Kowalski procedure 3]. More recently, You et al. deened the re...
متن کاملDisjunctive Logic Programming as Constrained Inferences
Previously we have proposed a logic, called priority logic 18, 20], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this paper is to investig...
متن کاملNORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING
I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...
متن کاملPartial Deduction in Disjunctive Logic Programming
CHIAKI SAKAMA AND HIROHISA SEKI y. This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal mode...
متن کامل